Constructing Quantum Error-Correcting Codes for p-State Systems from Classical Error-Correcting Codes∗

نویسندگان

  • Ryutaroh MATSUMOTO
  • Tomohiko UYEMATSU
چکیده

Quantum error-correcting codes have attracted much attention. Among many research articles, the most general and systematic construction is the so called stabilizer code construction [6] or additive code construction [2], which constructs a quantum error-correcting code as an eigenspace of an Abelian subgroup S of the error group. Thereafter Calderbank et al. [3] proposed a construction of S from an additive code over the finite field F4 with 4 elements. These constructions work for tensor products of 2-state quantum systems. However Knill [8], [9] and Rains [13] observed that the construction [2], [6] can be generalized to n-state systems by an appropriate choice of the error basis. Rains [13] also generalized the construction [3] using additive codes over F4 to p-state quantum systems, but his generalization does not relate the problem of quantum code construction to classical error-correcting codes. We propose a construction of quantum error-correcting codes for p-state systems from classical error-correcting codes which is a generalization of [3]. Throughout this paper, p denotes a prime number andm a positive integer. This paper is organized as follows. In Sect. 2, we review the construction of quantum codes for nonbinary systems. In Sect. 3, we propose a construction of quantum codes for p-state systems from classical codes over Fp2 . In Sect. 4, we propose a construction of quantum codes for p-state systems from classical linear codes over Fp2m . In Sect. 5, we discuss a

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q+1

The entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this paper, we construct five classes of entanglement-assisted quantum M...

متن کامل

Relations between Classical and Quantum Error{correcting Codes ?

In this survey we describe relations between classical and quantum error{correcting codes. After a brief introduction to both quantum computation and classical linear error{correcting codes, we show how to construct quantum error{correcting codes based on classical ones. Furthermore, quantum circuits for encoding and syndrome computation are presented.

متن کامل

Spatially correlated qubit errors and burst-correcting quantum codes

We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of burst errors in classical coding theory. We present several different efficient schemes for constructing families of such codes. For example, we construct a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999